Multi-dimensional bin packing problems with guillotine constraints

Multi-dimensional bin packing problems with guillotine constraints

The problem addressed in this paper is the decision problem of determining if a set of multi-dimensional rectangular boxes can be orthogonally packed into a rectangular bin while satisfying the requirement that the packing should be guillotine cuttable. That is, there should exist a series of face parallel straight cuts that can recursively cut the bin into pieces so that each piece contains a ...

Two-Dimensional Bin Packing Problem with Guillotine Restrictions

Construction heuristics for two-dimensional irregular shape bin packing with guillotine constraints

The paper examines a new problem in the irregular packing literature that has existed in industry for decades; two-dimensional irregular (convex) bin packing with guillotine constraints. Due to the cutting process of certain materials, cuts are restricted to extend from one edge of the stock-sheet to another, called guillotine cutting. This constraint is common place in glass cutting and is an ...

Constructive procedures to solve 2-Dimensional Bin Packing Problems with Irregular Pieces and Guillotine Cuts

This paper presents an approach for solving a new real problem in Cutting and Packing. At its core is an innovative mixed integer programme model that places irregular pieces and defines guillotine cuts. The two-dimensional irregular shape bin packing problem with guillotine constraints arises in the glass cutting industry, for example, the cutting of glass for conservatories. Almost all cuttin...

Algorithms for on-line bin-packing problems with cardinality constraints

The bin-packing problem asks for a packing of a list of items of sizes from (0; 1] into the smallest possible number of bins having unit capacity. The k-item bin-packing problem additionally imposes the constraint that at most k items are allowed in one bin. We present two e6cient on-line algorithms for this problem. We show that, for increasing values of k, the bound on the asymptotic worst-ca...